| 1. | We analysis the conflict , convert channel and starvation problems of concurrent schedule based on strict - 2pl locking protocal which applies nhstm model , then present a concurrent scheduling algorithm making use of buffer and point p . also , we proved the concurrent schedule algorithm is serializable . at the same time , we introduce the key technical used in nhsdb concurrency control mechanism , and give the implementation details
我们对应用nhstm模型的,通过应用严格两段锁协议实施的并发调度中,可能存在的并发冲突,隐通道和饥饿问题进行分析,在此基础上提出了一种利用缓冲和p点的并发调度算法,并给出了该算法的并发调度正确性证明,解决多级安全条件下的隐通道和饥饿问题。 |
